model-based problem solver

См. также в других словарях:

• Problem solving — forms part of thinking. Considered the most complex of all intellectual functions, problem solving has been defined as higher order cognitive process that requires the modulation and control of more routine or fundamental skills (Goldstein Levin …   Wikipedia

• Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …   Wikipedia

• Atmospheric model — A 96 hour forecast of 850 mbar geopotential height and temperature from the Global Forecast System An atmospheric model is a mathematical model constructed around the full set of primitive dynamical equations which govern atmospheric motions. It… …   Wikipedia

• Wicked problem — The concept of wicked problems was originally proposed by Horst Rittel (a pioneering theorist of design and planning, and late professor at the University of California, Berkeley) and M. Webber ref|1 in a seminal treatise for social planning,… …   Wikipedia

• Creative problem solving — is the mental process of creating a solution to a problem. It is a special form of problem solving in which the solution is independently created rather than learned with assistance. Creative problem solving always involves creativity. To qualify …   Wikipedia

• TK Solver — Infobox Software name = TK Solver caption = author = developer = Software Arts; Universal Technical Systems released = latest release version = 5.0 latest release date = latest preview version = latest preview date = operating system = Windows… …   Wikipedia

• Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… …   Wikipedia

• Robert L. Simpson, Jr. — Dr. Robert L. Simpson, Jr is whose primary research interest is in applied artificial intelligence, is Chief Scientist at Applied Systems Intelligence, Inc. (ASI), a small business focused on applied artificial intelligent solutions to government …   Wikipedia

• Computational fluid dynamics — Computational physics Numerical analysis  …   Wikipedia